Methods and systems for time-basing, matching, and reporting digital resumes, digital job orders and other electronic proposals

ABSTRACT

An infrastructure system ( 112 ) for facilitating the creation of time-based digital resumes ( 124 ) and time-based digital job orders ( 126 ) and the matching thereof ( 122 ), the system including an on-site exchange ( 118 ), a private exchange ( 114 ), and a public exchange ( 116 ). A time-basing method ( 228 ) for facilitating preprogrammed time-dependent variation in an electronic proposal. An aspiration matching method ( 150 ) for matching ( 122 ) a digital resume ( 124 ) to a digital job order ( 126 ), wherein the digital resume ( 124 ) includes at least one resume aspiration, and wherein the digital job order includes at least one job order aspiration, in order to achieve a high level of expected satisfaction between the submitter of the digital resume and the submitter of the digital job order upon consummation of a transaction based on the matching ( 122 ) of the resume ( 124 ) with the job order ( 126 ). A graphical reporting method for reporting feedback based on comparisons of time-based digital resumes and time-based digital job orders.

CROSS-REFERENCE TO RELATED PATENT APPLICATIONS

This patent application claims the benefit of U.S. Provisional PatentApplication No. 60/468,527, filed May 7, 2003 by inventor Jim Kohs; U.S.Provisional Patent Application No. 60/468,531, filed May 7, 2003 byinventor Jim Kohs; U.S. Provisional Patent Application No. 60/468,530,filed May 7, 2003 by inventor Jim Kohs; U.S. Provisional PatentApplication No. 60/468,529, filed May 7, 2003 by inventor Jim Kohs; andU.S. Provisional Patent Application No. 60/468,528, filed May 7, 2003 byinventor Jim Kohs.

The U.S. Provisional Patent Applications Nos. 60/468,527, 60/468,528,60/468,529, 60/468,530, and 60/468,531 are incorporated herein to themaximum extent allowable by law.

TECHNICAL FIELD OF THE DISCLOSURE

This disclosure pertains to methods and systems for time-basing,matching, and reporting digital resumes, digital job orders, and otherelectronic proposals.

BACKGROUND OF THE DISCLOSURE

The field of human resources does not now contain methods and systemsfor time-basing, matching, and reporting digital resumes, digital joborders, and other electronic proposals as disclosed herein.

BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the present disclosure, and theadvantages thereof, reference is now made to the following briefdescriptions taken in conjunction with the accompanying drawings, inwhich like reference numerals indicate like features.

FIG. 1 illustrates the increasing value of the present invention tohuman resource management professionals during the different humanresource management stages;

FIG. 2 shows one example of a digital resume formed consistent with theteachings of the present invention;

FIG. 3 illustrates one embodiment of the full-color graphical feedbackreports of the present invention;

FIG. 4 illustrates a national infrastructure for exchanging time-baseddigital resumes;

FIG. 5 shows the matching of digital resumes and digital job ordersincorporating aligned aspirations;

FIGS. 6 and 7 depict uses of matching criteria according to the presentinvention;

FIG. 8 presents a user interface for entering and maintaining time-basedmatching criteria over a given time line;

FIGS. 9 and 10 show the time-based matching of a digital resume to adigital job order;

FIG. 11 further illustrates the matching process of FIGS. 9 and 10 usinga user interface of the present invention;

FIG. 12 presents exemplary fields of use for the present invention;

FIG. 13 provides one illustration of a flow diagram for performing theaspiration matching functions of the present invention;

FIG. 14 shows the matching of digital resumes and digital job ordersincorporating aligned aspirations;

FIG. 15 depicts a user interface for time-based adjustment to a digitalresume;

FIG. 16 provides a flow diagram for the flatten steps of the presentinvention;

FIG. 17 provides a flow diagram for the virtual box process of thepresent invention;

FIGS. 18 through 21 show mathematical theory concepts relating to thevirtual box process associated with the aspiration matching functions ofthe present invention;

FIGS. 22 through 25 provide a data dictionary of the physical andvirtual data schema of the present invention;

FIG. 26 provides a flow chart depicting the steps of the ranking methodof the present invention;

FIG. 27 illustrates one aspect of the national infrastructure functionsof the present invention;

FIGS. 28 and 29 provide examples of the user interfaces associated withthe digital resume and digital job order creation functions of thepresent invention;

FIG. 30 shows the publishing and backfill methods of the presentinvention;

FIGS. 31 through 32 depict in further detail the digital resumeinfrastructure functions and associated architecture for the presentinvention;

FIG. 33 provides a flow diagram for the time-base process of the presentinvention;

DETAILED DESCRIPTION

The time-based digital resume aspiration matching process describedherein enables unique career aspirations embodied within a set oftime-based digital resumes to be analytically matched with the careeraspirations embodied within a set of time-based digital job orders. Thepresent embodiment of the aspiration matching process contains fiveseparate processes which interoperate to produce an analytic matchbetween a set of time-based digital resumes and a set of time-baseddigital job orders. These five processes are the flatten process, thevirtual box process, the matchbox process, the backfill process, and theranking process.

FIG. 1 illustrates the increasing value 100 of the present invention tohuman resource management professionals during the different humanresource management stages. FIG. 2 shows one example of a digital resume102 formed consistent with the teachings of the present invention. Theresume 102 allows interrelating information on career titles 106, skillareas 107, and industry experience 108. The resume 102 also includes asoft skills section 104.

FIG. 3 illustrates one embodiment 110 of the full-color graphicalfeedback reports of the present invention. FIG. 4 illustrates a possiblenational infrastructure 112 for exchanging time-based digital resumes.The infrastructure 112 includes private exchanges 114, at least onepublic exchange 116, and at least one on-site exchange 118. Electronicproposals can be published and backfilled 120 as desired. FIG. 5 showsthe matching 122 of digital resumes 124 and digital job orders 126incorporating aligned aspirations;

This disclosure provides an infrastructure system for facilitating thecreation of time-based digital resumes and time-based digital job ordersand the matching thereof, the system including an on-site exchange, aprivate exchange, and a public exchange. The on-site exchange is forreceiving, containing, and matching time-based digital job orders andtime-based digital resumes. The private exchange is for receiving,containing, and matching time-based digital job orders and time-baseddigital resumes. The public exchange is for receiving, containing, andmatching time-based digital job orders and time-based digital resumes.The on-site and private exchanges include a front-end platform forinteracting with the public exchange to backfill and publish.

The disclosure also provides a time-basing method for facilitatingpreprogrammed time-dependent variation in an electronic proposal.Time-based input data including one or more gradient value, the databeing suitable for dynamic time-dependent variance of values associatedwith at least one time-based electronic proposal, is received. Thetime-based electronic proposal is stored. The time-based electronicproposal is compared to one or more other electronic proposals. A matchvalue is calculated for each comparison of the time-based electronicproposal to one of the other electronic proposals.

The disclosure further provides an aspiration matching method formatching a digital resume to a digital job order, wherein the digitalresume includes at least one resume aspiration, and wherein the digitaljob order includes at least one job order aspiration, in order toachieve a high level of expected satisfaction between the submitter ofthe digital resume and the submitter of the digital job order uponconsummation of a transaction based on the matching of the resume withthe job order. A digital resume which includes at least one resumeaspiration is received. A digital job order which includes at least onejob order aspiration is received. The resume aspiration is compared tothe job order aspiration. An aspiration match value is calculated on thebasis of the comparison of the at least one resume aspiration to the atleast one job order aspiration, wherein the aspiration match value iscalculated to correlate highly with expected satisfaction of thesubmitter of the resume and the submitter of the job order subsequent topost-comparison consummation of a transaction based upon the match.

Additionally, the present disclosure provides a graphical reportingmethod for reporting feedback based on comparisons of time-based digitalresumes and time-based digital job orders. At least one interim analyticfactor is received. Each factor represents the result of comparison of atime-based digital resume and a time-based digital job order. Afill-color graphical report is displayed based on the interim analyticfactors, wherein the report depicts each interim analytic factor as agraphical entity.

Other aspects, objectives and advantages of the invention will becomemore apparent from the remainder of the detailed description when takenin conjunction with the accompanying drawings.

The present invention provides a multi-dimensional time-based digitalresume that effectively replaces the paper-based resume. It is based onthe growing body of HR industry exchange standards, individually owned,and exchanged thru e-mail, diskettes, and Web sites just like otherelectronic documents.

Because “Everything Changes Over Time”, the time-based digital resumematching criteria are time-based, which predispositions them toself-maintain their currency, and enables proactive matching with thesimple progression of time. Both the employee and employer benefit fromthis feature.

Unlike a paper resume which limits expression of a candidate's robustprofessional background and their diverse career aspirations, thetime-based digital resume accommodates an unlimited depth of backgroundand aspiration data. The time-based digital resume graphical softwareviewer enables others to read the digital resume similar to otherelectronic documents. The Toolkit also enables the time-based andgradient weighting criteria input by the candidate, and enables theprivacy and anonymity features.

Time-Based digital resumes are actively maintained within an on-site,private or the public exchange, continually matching up with time-baseddigital job orders in the exchange sending full-color graphical feedbackreports to both the candidate and the employer. Because time-baseddigital resumes are time-based, each day can deliver entirely differentanalysis and relevance ranking reports, leading to an arbitratedcandidate-employer match based solely on the progression of time.

The present invention further provides a time-based digital job orderformat that streamlines the human resources business processcommunications among employers, recruiters, and Web job boards. It isbased on the growing body of human resource industry exchange standards,owned by the human resources professional, and exchanged thru e-mail,diskettes, and Web sites just like other electronic documents.

Because “Everything Changes Over Time”, the time-based digital job ordermatching criteria are time-based in the same manner as the time-baseddigital resume, which predispositions them to self-maintain theircurrency, and enables proactive skills matching with the simpleprogression of time.

The known paper job orders limit the ability to detail the backgroundskills required for the job, and also limits career aspirations to a fewcatch phrases like: “management potential”, “career orientated”, or“fast paced”. The time-based digital job order accommodates an unlimiteddepth of background and aspiration data.

Time-Based digital job orders are actively maintained within an on-site,private or the public exchange, continually matching up with time-baseddigital resumes in the exchange sending full-color graphical feedbackreports to both the employer and the candidate. Because time-baseddigital resumes are dependent on ‘time’, each day can deliver entirelydifferent analysis and relevance ranking reports, leading to anarbitrated employer-candidate match based simply on the progression oftime.

A time-based digital resume matches up with a time-based digital joborder when an employer or agent submits a time-based digital job orderinto an on-site, private or the public exchange full of time-baseddigital resumes. Based on advanced data analytics, each time-baseddigital job order is matched and relevance ranked against each availabletime-based digital resume, and the results are delivered in full-colorgraphical feedback reports, for 360° feedback to both the employer andthe candidate.

The design goal of the full-color graphical feedback reports is to bringcost savings to the employer by delivering valuable ‘information’ to theright recipient at the right time, so that appropriate career decisionscan be made.

The present invention provides weighted “preference”, “proficiency” and“importance” criteria defined to change over a defined period of time.When an employer creates a paper job order or a candidate creates apaper resume, the information is based on a single point in ‘time’,usually based on the situation as it is known to be “today”, or “nextmonth”. Although situations may change dramatically over short periodsof time, paper and ink simply do not accommodate such robust expressionsof change.

When an employer authors a paper job order, they inflate their selectioncriteria knowing that they'll probably end up hiring a candidate whodoes not match all of their selection criteria. This is why so manyunqualified candidates apply for positions believing that the employermay never find an ‘exact match’ for their job order, and may negotiateon a few selection criteria. When a candidate authors their resume, theyalso inflate their career aspirations and salary requirements, knowingthat they will have to negotiate on a few selection criteria.

FIGS. 6 and 7 show non-time-based keyword fields 128, 130 for the skillsmatching criteria of ‘travel’, similar to what is seen in the knownskills matching software. There is no allowance for this criteria tochange over time, nor indication of whether the candidate prefers orcould tolerate travel at this level. There is no indication as to ‘howlong’ is this ‘requirement’ or ‘preference’ will be valid for? Threemonths? Three years? There is also no indication of weighting, toindicate whether this criteria is high or low on the employer orcandidates list of needs.

“Because time really does matter”, the software tools used to createboth the time-based digital resumes and the time-based digital joborders are time-based, allowing for an expression of criteria to changeover a period of time. The software tools enable the expression of“preference”, “proficiency” and “importance” weighting for eachselection criteria. Some matching criteria are absolute deal-killers,meaning they are non-negotiable. Other matching criteria arenice-to-haves, meaning that they are thrown into the resume asbargaining chips for negotiation. The following example shows how theprogression of time effects time-based matching criteria, along with thecandidate's “preference” for the criteria.

A junior consultant has been working at a big 5 consulting firm forseveral years now, traveling nearly 100% of the time. He is trying tobalance his life-work scenario and is seeking local projects thatrequire less than 50% travel. The consultant time-bases his “preference”for travel, rising from zero up thru 50% over an initial 30 days.Knowing that he must maintain a high utilization rate and cannot sit for60 days ‘on-the-bench’, he extends his time-based “preference” fortravel up from 50% thru 100% over the following 30 days. The juniorconsultant gradually increased his expectations for Travel from zero upto 100% over a 60 day period.

A partner in this same big 5 consulting firm has just signed a clientcontract and needs skills like those of the junior consultant. Thispartner prefers a consultant willing to travel 100% of the time, butmight allow the work to be performed remotely with partial travel. Hetime-bases his “preference” for travel, decreasing from 100% down thru50% over an initial 30 days when the project is scheduled to ramp-up.Knowing that the position cannot go unfilled for more than 60 days, hefurther extends the time-based “preference” for travel down from 50%thru zero over the following 30 days. The partner gradually reduces hisexpectations for travel from 100% down to zero over a 60 day period.

FIG. 8 presents a user interface 132 for entry of time-based data over auser defined period of time.

FIGS. 9 and 10 show the matching of a time-based digital resume to atime-based digital job order as graphical illustrations 134, 136, 138,and 140.

FIG. 11 provides a further time-based example 142 for the presentinvention. The time-based digital resumes software tools model thecurrent human resources management industry's skills matching process,by establishing an infrastructure of anonymity for a candidate'spersonal information. When a candidate's digital resume shows up as arelevant match on an employer's digital job order report, the employerwill not see the candidate's personal information.

The employer will have access through the time-based digital resumeson-site, private or the public exchange infrastructure to notify thematched candidate of their interest, and the candidate may thenself-select whether to correspond with the potential employer.

Teamed digital resumes are similar in their function to time-baseddigital resumes, except that they represent a group of candidates whowork together as a team, and therefore present themselves into thetime-based digital resumes exchange as a ‘team.’ Candidates who worktogether on assignment as a team, can submit a teamed digital resumeinto an exchange to be matched and relevance ranked against availableteamed digital job orders.

Employers benefit from the time-based digital job order of the presentinvention because the digital job order is based on the growing body ofhuman resources management industry exchange standards. They areavailable for use within an on-site, private or the public exchange, orfor distribution through agencies, recruiters and Web boards whoparticipate in the talent matching process. In particular, FIG. 12illustrates in some detail 144 the different market segments 148 towhich the processes and component parts of the system 146 of the presentinvention pertain.

Because “Everything Changes Over time”, the time-based digital job ordercriteria are based on time and self maintain themselves as timeprogresses, time-based digital job orders that are actively maintainedwithin an on-site, private or the public exchange, continue to match upwith active time-based digital resumes in the exchange, producingfull-color graphical feedback reports to both the employer and thecandidate. Because the time-based digital job order is based on time,each day can deliver entirely different analysis and relevance rankingreports, leading to an automated candidate-employer match somewhere inthe middle of each set of needs, due to the effect of time'sprogression.

The time-based digital resume provides software tools that model thecurrent human resources management industry's skills matching process byestablishing an infrastructure of anonymity for a candidate's personalinformation. When an employer's time-based digital job order shows up asa relevant match on a candidate's time-based digital resume report, thecandidate will not see the employer's personal information.

The candidate has access through the time-based digital resumes on-site,private or the public exchange infrastructure to notify the matchedemployer of their interest. The employer may then self-select whether tocorrespond with the potential candidate.

The time-based digital resume provides software tools that offersignificant potential cost savings within organizations with largedeployable and dynamic work forces, like consulting firms. When aninternal consultant knows that their project is wrapping up, theyself-maintain their own time-based digital resume and submit it into theemployer's exchange for matching against all active time-based digitaljob orders. They can then prospect their time-based career aspirationsagainst the employer's active time-based digital job orders. Using theirfull-color graphical feedback reports the candidate can then adjusttheir career aspirations to more closely match the needs of theiremployer.

The time-based digital resume also provides software tools forestablishing an inter-agency hub which enables an employer to expandtheir time-based digital job order search beyond the limits of theiron-site or private exchange. Employers can interlink their exchangesproviding extended reach for their time-based digital job orders, andextended visibility for their time-based digital resumes. The time-baseddigital resumes public exchange is available to backfill any time-baseddigital job order needing to extend their reach beyond their ownon-site, private or interlinked exchange.

The time-based digital job order of the present invention bringssignificant cost savings to organizations with large deployable anddynamic work forces, like consulting firms.

Teamed digital job orders are similar in their function to time-baseddigital job orders, except that they represent a job order for a groupof candidates who work together as a team, rather than one singlecandidate. An employer can submit a teamed digital job order into theiron-site or private exchange to be matched and relevance ranked againstavailable teamed digital resumes.

Both the digital resume and the digital job order are based on thegrowing body of human resources management industry standards like thehuman resources management-XML Organization's SIDES (Staffing IndustryData exchange Standards) formats. The present invention incorporatesstandards for exchangeable digital resume data, to assure participantsof interoperability, growth and scalability.

Time-based digital resumes have use in local and national colleges andWeb job boards across the country. College students entering the jobmarket with accomplished resumes, and varied career aspirations wille-mail their time-based digital resume along with the graphical softwareviewer. Agencies and recruiters will offer viewable time-based digitalresumes in addition to text resumes on their candidates. Web job boardswill display the time-based digital resumes logo, and will offer thetoolkits for creating and maintaining both time-based digital resumesand time-based digital job orders.

Select corporations and consulting firms will purchase the time-baseddigital resumes private exchange solution, to provide time-based skillsmatching, for their large staff of in-house consultants. This type ofsolution increases both the utilization rate of their consultants, andthe retention rate due to the career aspiration matching capabilities.

TIME-BASED DIGITAL RESUME ASPIRATION MATCHING PROCESS: The processes ofskills matching available in the marketplace today are based on a user'sinput of discrete pieces of static selection criteria. FIG. 13 shows oneexample of a flow diagram 150 for performing the functions of theaspiration matching process of the present invention. Examples of thesediscrete pieces of static selection criteria include salary and travelrequirements, and explicitly stated skill levels in pre-defined hardskills. These discrete pieces of static selection criteria are requiredas input from both the candidate (the resume) and the employer (the joborder) in order to perform a match between the two. These currentprocesses of skills matching use their discrete pieces of staticselection criteria to perform increasingly thorough data analytics, inpursuit of the most accurate match between the candidate (the resume)and the employer (the job order). These data analytics fall undercategories like: keyword matching, data analytics, artificialintelligence, and learning algorithms. FIG. 14 shows the matching 152 ofdigital resumes and digital job orders incorporating alignedaspirations. FIG. 15 depicts a user interface 154 for time-basedadjustment to a digital resume.

The time-based digital resume aspiration matching process of skillsmatching differentiates itself from other skills matching processescurrently in use, by A) using dynamic time-based selection criteria asinput, and by B) using career aspirations data rather than backgrounddata as input, and C) by producing full-color graphical feedback reportsas outputs to inform the user of the analytical results of theaspiration matching process, and D) by enabling user control over theaccuracy of the skills matching algorithms, and E) enabling user controlover the urgency of the skills matching, and by F) enabling user controlover the degree to which skills matching is based on aspirations overbackground selection criteria

Time-based aspirations data is explicitly input from the user inassociation with a calendar period of time, resulting in dynamicallychanging skills matching selection criteria. These time-basedaspirations selection criteria are input by both the candidate (thetime-based digital resume) and the employer (the time-based digital joborder), and made available to the time-based digital resume aspirationsmatching process, where they are manipulated by the flatten process, thevirtual box process, the backfill process, the ranking process, andstored into the matchbox process.

The time-based digital resume aspirations matching process describedherein covers the flatten process, the virtual box process, the backfillprocess, the ranking process, and the matchbox process. FIG. 16 providesa flow diagram 156 for the flatten process. Table 1 depict the conceptsand instructions for performing the various steps and associatedfunctions of the flatten process.

TABLE 1 private int flatten_Cube_TimeBase( Cube.TimeBaseDataTable tbT,string skUID, string tbType ) {return ( flatten_Cube_TimeBase( tbT,skUID, tbType, “”, “”, “” )); } private int flatten_Cube_TimeBase(Cube.TimeBaseDataTable tbT, string skUID, string tbType, string id1,string id2, string id3 ) {///================================================================================/// Purpose: Translate a set of TimeBase Points over a given time span,/// into a singular Y value representative of the Yvalue on the ///given runDate of this Matching Engine execution. /// Function: ///Status: /// Future:///================================================================================Point[ ] myPoints = new Point[10]; Cube.TimeBaseRow tbRow =tbT.FindByskUIDtbTypeid1id2id3( skUID, tbType, id1, id2, id3 ); if (tbRow == null) { dbError dbe = new dbError( ); dbe.text1Label.Text = “inflatten_Cube_timebase( ) − tbRow is null ”; dbe.text2Label.Text =“skUID: ”+skUID; dbe.text3Label.Text = “Plus: id1(“+id1+”),id2(“+id2+”), id3(“+id3+”), tbType(“+tbType+”)”; dbe.ShowDialog( );dbe.Dispose( ); return ( ); } // =============================== // ifrunDate is before/after the TB span, then return the Y0/Y9 value andwe're thru // =============================== if ( runDate <=tbRow.startDate ) return tbRow.Y0; else if( runDate >= tbRow.endDate )return tbRow.Y9; // =============================== // so we're withinthe TBspan(not befor X0, or after X9. find the appropriate segment, //and calculate the Yvalue // ===============================myPoints[0].X = tbRow.X0; myPoints[1].X = tbRow.X1; myPoints[2].X =tbRow.X2; myPoints[3].X = tbRow.X3; myPoints[4].X = tbRow.X4;myPoints[5].X = tbRow.X5; myPoints[6].X = tbRow.X6; myPoints[7].X =tbRow.X7; myPoints[8].X = tbRow.X8; myPoints[9].X = tbRow.X9;myPoints[0].Y = tbRow.Y0; myPoints[1].Y = tbRow.Y1; myPoints[2].Y =tbRow.Y2; myPoints[3].Y = tbRow.Y3; myPoints[4].Y = thRow.Y4;myPoints[5].Y = tbRow.Y5; myPoints[6].Y = tbRow.Y6; myPoints[7].Y =tbRow.Y7; myPoints[8].Y = thRow.Y8; myPoints[9].Y = tbRow.Y9; return (flatten( myPoints, tbRow.numPoints, tbRow.startDate, tbRow.endDate ) );} private int flatten_Req_TimeBase( Req.ReqTimeBaseDataTable tbT, stringcompanyName, string skrUID, string tbType ) {return (flatten_Req_TimeBase( tbT, companyName, skrUID, tbType, “”, “”, “” )); }private int flatten_Req_TimeBase( Req.ReqTimeBaseDataTable tbT, stringcompanyName, string skrUID, string tbType, string id1, string id2,string id3 ) {///================================================================================/// Purpose: Translate a set of TimeBase Points over a given time span,/// into a singular Y value representative of the Yvalue on the ///given runDate of this Matching Engine execution. /// Function: ///Status: /// Future:///================================================================================Point[ ] myPoints = new Point[10]; Req.ReqTimeBaseRow tbRow =tbT.FindBycompanyNameskrUIDtbTypeid1id2id3( companyName, skrUID, tbType,id1, id2, id3 ); if ( tbRow == null) { dbError dbe = new dbError( );dbe.text1Label.Text = “in flatten_req_timebase( ) − tbRow is null”;dbe.text2Label.Text = “Company Name: ”+companyName; dbe.text3Label.Text= “skrUID: ”+skrUID; dbe.text4Label.Text = “Plus: “+id1+”, “+id2+”,“+id3+”, ”+tbType; dbe.ShowDialog( ); dbe.Dispose( ); return ( ); }//================================================== //if runDate isbefore/after the TB span, then return the Y0/Y9 value and we're thru//================================================== if ( runDate <=tbRow.startDate ) return tbRow.Y0; else if( runDate >= tbRow.endDate )return tbRow.Y9; //================================================== //so we're within the TBspan(not befor X0, or after X9. // find theappropriate segment, and calculate the Yvalue//================================================== myPoints[0].X =tbRow.X0; myPoints[1].X = tbRow.X1; myPoints[2].X = tbRow.X2;myPoints[3].X = tbRow.X3; myPoints[4].X = tbRow.X4; myPoints[5].X =tbRow.X5; myPoints[6].X = tbRow.X6; myPoints[7].X = tbRow.X7;myPoints[8].X = tbRow.X8; myPoints[9].X = tbRow.X9; myPoints[0].Y =tbRow.Y0; myPoints[1].Y = tbRow.Y1; myPoints[2].Y = tbRow.Y2;myPoints[3].Y = tbRow.Y3; myPoints[4].Y = tbRow.Y4; myPoints[5].Y =tbRow.Y5; myPoints[6].Y = tbRow.Y6; myPoints[7].Y = tbRow.Y7;myPoints[8].Y = tbRow.Y8; myPoints[9].Y = tbRow.Y9; return ( flatten(myPoints, tbRow.numPoints, tbRow.startDate, tbRow.endDate ) ); } privateint flatten( Point[ ] myPoints, int numPoints, DateTime startDate,DateTime endDate ) {///========================================================== ========/// Purpose: Translate a set of TimeBase Points over a given time span,/// into a singular Y value representative of the Yvalue on the ///given runDate of this Matching Engine execution. /// Function: ///Status: /// Future:///========================================================== ========float flatY; float flatX; float segmentrunPercent; float segmentrise;float runX; float riseY; long tbTicks; long runDateTicks; // determine #of ticks between tbRow.end and tbRow.start // determine wherebefore/middle/end of start-end spread, that the runDate falls // grabthose two tbPoints(left & right), build a rise/run box, reconcile riseto get flatY value tbTicks = endDate.Date.Ticks − startDate.Date.Ticks;runDateTicks = runDate.Date.Ticks − startDate.Date.Ticks; flatX =(runDateTicks* TB_LENGTH/*100 or 1000*/) / tbTicks;//============================== // identify the TB segment which boundsthe given runDate // use the flatX to geometrically slice the virtualbox of the TB segment //============================== int i; for (i =1; i< numPoints; i++) if( myPoints[i].X >= flatX ) break; // loop tofind the appropriate TB segment /// pseudo code //since we're here,there's a point[i] on our right, and a point on our left[i-1]//calculate the runx as the run distance between the leftX and rightX//calculate the riseY as the rise distance between the leftY and rightY//calculate the segmentrunPercent(how far into the runX is the flatX?)//then apply the segmentrunPercent(as a geometirc equivilant%(rise%=run%) )to the riseY giving segmentrise //Giving: the flatY asthe leftY plus the riseY :-) Whew ! runX = myPoints[i].X −myPoints[i-1].X; riseY = myPoints[i].Y − myPoints[i-1].Y;segmentrunPercent = (flatX − myPoints[i-1].X)/runX; //bugsegmentrunPercent = flatX/runX; segmentrise = riseY * segmentrunPercent;flatY = myPoints[i-1].Y + segmentrise; if( flatY > 100) flatY = 100;else if (flatY < 0) flatY= 0; return (Convert.ToInt32( flatY ) ); }//end( )

The time-based digital resume aspirations matching process flowssequentially from the flatten process, through the virtual box process,into the backfill process, into the matchbox process, and finally intothe ranking process. FIGS. 17 through 21 and Tables 2-7 relate to thevirtual box process of the present invention. Whereas FIGS. 22 through25 address the matchbox process. Concepts and instructions relating toone embodiment of the ranking process of the present invention appear inTables 8 and 9. These five processes reduce the time-based aspirationsskills matching selection criteria into static selection criteria, thenrelate the static selection criteria of the time-based digital resume tothose of the time-based digital job order, then backfill time-baseddigital resumes from other exchanges into a single exchange, thenprovide retention for the results, and then assign priority rankings tothe matching relationship.

TABLE 2 private void build_virtual_box( int accuracy ) { ///================================================ == /// Purpose: Updatetwo points of the Virtual Box, based on a given Accuracy value ///Function: See jkohs notes for technical details on this function. ///These two points symbolically represent all eight points of the /// fourAccuracy segment lines. But due to Reflection of the /// quadrants, onlythese two are physically necessary to calculate. /// Status: ///Future:could preset some of this math, rather than re-re-re executing it for ehDriver /// could draw a jpeg of this cube and stuff it into the Cube/Reqfor later display? ///History: -- -- -- jkohs initail coding ///12-29-03 jkohs implemented V2 of the Virtual Box ///=================================================== double diag =Math.Sqrt( (TB_LENGTH*TB_LENGTH)/2); double indent = diag *(1-VB_PRACTICAL_BASE); double workableDiag = diag − indent; doubleminiDiag; double miniXY; miniDiag = (accuracy * workableDiag) / 100;miniXY = Math.Sqrt( (miniDiag*miniDiag)/2); ulAPoint.X =Convert.ToInt32( miniXY ); ulAPoint.Y = Convert.ToInt32( TB_LENGTH −miniXY ); urAPoint.X = Convert.ToInt32( (TB_LENGTH/2) + miniXY );urAPoint.Y = Convert.ToInt32( (TB_LENGTH*1.5) − miniXY );

TABLE 3 private int do_Virtual_Box( int driverFlatY, int riderFlatY ) {///===================================================== /// Purpose:Graph X vs. Y values into the Virtual Box to derive Perfect Match1000(PM1000) values /// Function: Each of the three quadrant(pos M, negM, MM) logics differ . . . /// Station: ///Future: ///History: -- -- --jkohs initial coding /// 12-29-03 jkohs changes for V2 of Virtual Boxw/reflection /// =====================================================int ppm 1000; float shorterSegment; float longerSegment; PointreflectedP = new Point( ); //================================= //reflect the X-Y pair through mirroring, into the upper-center twotriangles of the VB //================================= reflectedP =reflect_point( driverFlatY, riderFlatY );//================================= // Now we KNOW that the XY pair isin the upper-middle two diagonals of the VB // Run the VB Mathmatics toassign a PM1000 value to this XY pair //========================= if (is_this_point_below_segment( reflectedP.X, reflectedP.Y, ulAPoint,urAPoint ) ) { ///calc LRM & ULM with: ///calc LRM 250-1000 as A0///calc len MP-LRM as A1 ///calc len ULM-LRM as A2 ///calc PM1000 as:/// 250−(A1/A2*250) Point lrmP = new Point( ); Point lrmP1 = new Point(); Point lrmP2 = new Point( ); Point ulmP = new Point( ); Point ulmP1 =new Point( ); Point ulmP2 = new Point( ); int lrm; int ulm; lrmP1.X =lrmP1.Y = ulmP2.X = reflectedP.X; lrmP2.X = lrmP2.Y = ulmP1.Y =reflectedP.Y; ulmP1.X = ulAPoint.X + (ulmP1.Y-ulAPoint.Y); // equally asfar right, as is far up ulmP2.Y = ulAPoint.Y + (ulmP2.X-ulAPointX); //equally as far up, as is far right // lrm's X-Y coords are found mid-waybetween lrm1's & lrm2's X-Y coords // urm's X-Y coords are found mid-waybewteen urm1's & urm2's X-Y coords lrmP.X = ( lrmP2.X − lrmP1.X )/2 +lrmP1.X; lrmP.Y = ( lrmP2.Y − lrmP1.Y )/2 + lrmP1.Y; ulmP.X = ( ulmP2.X− ulmP1.X )/2 + ulmP1.X; ulmP.Y = ( ulmP2.Y − ulmP1.Y )/2 + ulmP1.Y;//calculate distance bewteen Perfect Match line, and Accuracy(ones) line//then calculate distance of MisMatch Point as percentile between PMM &Accuracy lines shorterSegment = (float) Math.Sqrt ( 2 *Math.Pow(ulmP.X-reflectedP.X), 2) ); longerSegment = (float) Math.Sqrt (2 * Math.Pow((ulmP.X-lrmP.X, 2      )     ); //preset ulm value at onesline(==1), then calculate value of lrm between min-max ulm = 1; //preset as the ‘Ones Line’. FUTURE: could vary lrm = ( (( lrmP.X −cPoint.X ) * (VB_PRECISION − VB − PRECISION_MIN))/(TB_LENGTH/2) ) +VB_PRECISION_MIN; pm1000 = Convert.ToInt32(( shorterSegment *(lrm-ulm))/longerSegment); } else { // Mismatch /// calc ULM & LRMM ///calc len MMP-LRMM as B1 /// cal len ULMM-LRMM as B2 /// calc pm 1000 as:/// (−1)*(B1/B2*1000) Point lrmmP = new Point( ); Point lrmmP1 = newPoint( ); Point lrmmP2 = new Point( ); Point ulmmP = new Point( ); PointulmmP1 = new Point( ); Point ulmmP2 = new Point( ); int lrmm; int ulmm;lrmmP1.X = ulmmP2.X = reflectedP.X; lrmmP2.Y = ulmmP1.Y = reflectedP.Y;lrmmP1.Y = ulAPoint.Y + (lrmmP1.X − ulAPoint.X); lrmmP2.X = ulAPoint.X +(lrmmP2.Y − ulAPoint.Y); ulmmP1.X = ulPoint.X + (ulmmP1.Y − ulPoint.Y);ulmmP2.Y = ulPoint.Y + (ulmmP2.X − ulPoint.X); // lrmm's X-Y coords arefound mid-way between lrmm1's & lrmm2's X-Y coords // urmm's X-Y coordsare found mid-way between urmm1's & urmm2's X-Y coords lrmmP.X = (lrmmP2.X − lrmmP1.X )/2 + lrmmP1.X; lrmmP.Y = ( lrmmP2.Y − lrmmP1.Y)/2 + lrmmP1.Y; ulmmP.X = ( ulmmP2.X − ulmmP1.X )/2 + ulmmP1.X; ulmmP.Y= ( ulmmP2.Y − ulmmP1.Y )/2 + ulmmP1.Y; //calculate distance betweenPerfectMismatch line, and Accuracy(ones) line //then calculate distanceof MisMatch Point as percentile between PMM & Accuracy linesshorterSegment = (float)MathSqrt ( 2 * Math.Pow((ulmmP.X−reflecedP.X),2) ); longerSegment = (float)Math.Sqrt ( 2 * Math.Pow((ulmmP.X−lrmmP.X),2) ); //preset ulmm value equal to −1000. FUTURE: could vary //presetlrmm value equal to −1. FUTURE: could vary //then calc prmm valuebetween −1 & −1000 as same percentage of smaller segment vs. largersegment lrmm = −1; // preset as the ‘Ones Line’ ulmm = −1000; // presetas maximum PM1000 Mismatch if ( longerSegment == 0 ∥ shorterSegment ==0) pm1000 = −1; else pm1000 = ulmm − Convert.ToInt32( ( shorterSegment *(ulmm-lrmm) ) / longSegment ); } return pm1000; } //end( )

TABLE 4 private int do_Report_Quad( int driverFlatY, int riderFlatY ) {/// ==================================================== /// Purpose:Geometrically assign the two flatY values to be a Match, /// Mismatch orLacking value /// Function: /// Status: ///Future: smoosh thesemulti-lines into one firmly unreadable & tight /// line of code forperformance, as this is another choke point for the Engine ///History:01-21-2003 jkohs halved the code using greater/lesser and /// anasymetric view of the VB ///also patched for variance betweenTB_Length(CubeKit uses 0-100), and Virtual Box(0-1000) /// 12-30-2003jkohs updated for new VB ///==================================================== // REPORTQUAD_MATCH// REPORTQUAD_MISMATCH // REPORTQUAD_LACKING // REPORTQUAD_EQUALED PointreflectedP = new Point( ); reflectedP = reflect_point (driverFlatY,riderFlatY); if ( is_this_point_below_segment( reflectedP.X,reflectedP.Y, ulAPoint, urAPoint ) ) return REPORTQUAD_MATCH; elsereturn REPORTQUAD_MISMATCH; } //end( )

TABLE 5 private bool is_this_point_below_segment( int anyX, int anyY,Point leftPoint, Point rightPoint ) { ///==================================================== ======== ///Purpose: Given a single Point, plus two points of a segment, determine/// if the given point is above or below the segment /// Function: ///Status: this code is plagerized from the flatten routine ////Future:smoosh the code into a single unreadable line for speed(this routine isa choke point) /// History: 01-21-2003 jkohs patched algorythm ///==================================================== ======== doubleriseY; double runX; double flatX; double cross; riseY = rightPoint.Y −leftPoint.Y; runX = rightPoint.X − leftPoint.X; flatX = anyX −leftPoint.X; cross = leftPoint.Y + (riseY/runX * flatX); return ( anyY <cross ? true : false); } //end( )

TABLE 6 private int do_LR_quadof_Virtual_Box( int driverFlatY, intriderFlatY ) { /// ==================================================/// Purpose: Given two flatY values in the LL Quadrant of the VBox, ///divine a PlusMinus5000 value. /// Function: /// Status: ///Future:smoosh these lines down for efficiency, and tune /// add benefit forproximity to ‘perfect match’ line ///================================================= /// pseudo code ///using the greater of driverFlatY or riderFlatY (hiY) /// calc runX as100(one hundred is TB_LENGTH) minus hiY /// divide runX by 50(fifty is ½of TB_PRECISION)giving relative X /// multiply that relative X *1000(one thousand is VB_PRECISION) /// since we're a MisMatch, make thata negative number ///giving PM 1000 :-) int runX; int pm 1000; if (driverFlatY > riderFlatY ) runX = TB_LENGTH−driverFlatY; else runX =TB_LENGTH.−riderFlatY; pm1000 = Convert.ToInt32( VB_PRECISION −((runX*VB_PRECISION)/(TB_LENGTH/2)) ); if (pm1000 == 0) pm1000 = 1; //pm1000 values must never be zero, because of later mathmatics return (pm1000 * −1); } //end( )

TABLE 7 private int do_LL_quad_of_Virtual_Box( int driverFlatY, intriderFlatY ) { /// ==================================================/// Purpose: Given two flatY values in the LL Quadrant of the VBox, ///divine a PlusMinus5000 value. /// Function: /// Status: ///Future: ///================================================== /// pseudo code ///using the greater of driverFlatY or riderFlatY(hiY) as runX /// calcrelative X value as runX divided by 50(fifty is 1/2 of TB_PRECISION) ///multiply that relative X * 1000(one thousand is VB_PRECISION) /// givingPM5000 :-) int pm1000; if ( driverFlatY > riderFlatY ) pm 1000 =Convert.ToInt32( VB_PRECISION − ((driverFlatY*VB_PRECISION) /(TB_LENGTH/2)) ); else pm1000 = Convert.ToInt32( VB_PRECISION −((riderFlatY*VB_PRECISION) / (TB_LENGTH/2)) ); if (pm1000 == 0) pm1000 =1; // pm1000 values must never be zero, because of later mathmaticsreturn pm1000; } //end( )

TABLE 8 private int do_UR_quad_of_Virtual_Box( int driverFlatY, intriderFlatY ) { /// ================================================ ///Purpose: Given two flatY values in the LL Quadrant of the VBox, ///divine a PlusMinus5000 value. /// Function: /// Status: ///Future: ///================================================== /// pseudo code ///using the lesser of driverFlatY or riderFlatY (loY) /// calc riseY as100(one hundred is TB_LENGTH) minus loY /// divide riseY by 50(fifty is½ of TB_PRECISION)giving relative Y /// multiply that relative Y *1000(one thousand is VB_PRECISION) /// since we're in the UR Quad, leavethat number positive /// giving PM1000 :-) int pm1000; if ( driverFlatY< riderFlatY) pm1000 = Convert.ToInt32( VB_PRECISION − (((TB_LENGTH−driverFlatY)* VB_PRECISION) / (TB_LENGTH/2)) ); else pm1000 =Convert.ToInt32( VB_PRECISION − (((TB_LENGTH− riderFlatY)* VB_PRECISION)/ (TB_LENGTH/2)) ); if (pm1000 == 0) pm1000 = 1; // pm1000 values mustnever be zero, because of later mathmatics return pm1000; } //end( )

The flatten process of the time-based digital resume aspirationsmatching process reduces the time-based aspirations selection criteriaof both the time-based digital resume and the time-based digital joborder, into discrete, static, and quantitative selection criteria (“flatY” values). The flatten process takes its input from time-basedselection criteria created thru the digital resume time-based process.Using this time-based selection criteria (the “Y” value) along with asingle calendar date (the “X” value), the geometric mathematicalalgorithms are applied to derive one single static, discrete andquantitative selection criteria (“flat Y” value) for the given date.

The time-based digital resume virtual box process 170, 172, 174, 176,Tables 2-8 encompasses the theoretical and practical mathematicalalgorithms for assigning numerically quantitative matching numbers(“perfect match 1,000 numbers”), representative of the relative match ormismatch between the static selection criteria of one time-based digitalrésume's “flat Y” value, and the static selection criteria of onetime-based digital job order's “flat Y” value.

The prerequisite flatten process reduces the dynamic time-basedaspiration selection criteria into static selection criteria (a “flat Y”value) ranging from zero to 100, with a midpoint of 50. The midpoint of50 represents a default preference value, i.e.: a ‘weak’ preference. Thezero and 100 values represent strong deflections of preference from thecenter point, either for or against a particular skill matchingselection criterion.

The virtual box process is based on the concept that there is an ‘ideal’match between the skills matching criteria of a particular time-baseddigital resume and the same skills matching criteria of a particulartime-based digital job order. FIGS. 17 through 21 associate with thevarious steps, functions, and associated instructions for performing thevirtual box process of the present invention. This ‘ideal’ match iscalled the ‘perfect match 1,000’, and ranges numerically from zero thrupositive 1,000 (zero thru+1,000), or ‘PM 1000’ for shorthand. A PM 1000value of zero indicates that the selection criteria of the time-baseddigital resume perfectly matched the selection criteria of thetime-based digital job order, but neither one of the inputs placed anystrength in their mutual selection criteria. A PM 1000 value of 1,000indicates again that the selection criteria of the time-based digitalresume perfectly matched the selection criteria of the time-baseddigital job order, and that each of the inputs placed the utmoststrength in their mutual selection criteria (i.e.: this would occur whenboth selection criteria deflected their “flat Y” (time-based aspirationpreference) to the utmost deflection into the same direction (bothtowards zero or both towards 100) away from the center point of 50). Thevirtual box process is also based on the concept that there is a ‘worstcase’ mismatch between the skills matching criteria of a particulartime-based digital resume, and the same skills matching criteria of aparticular time-based digital job order.

This ‘worst case’ mismatch is expressed within the ‘Perfect match1,000’, with the numerical ranges from negative 1,000 thru negative one(−1,000 thru −1), also ‘PM1000’ for shorthand. A PM 1000 value of −1indicates that the selection criteria of the time-based digital resumeabsolutely mismatched the selection criteria of the time-based digitaljob order, but neither one of the inputs placed any strength in theiropposing selection criteria. A PM 1000 value of −1,000 indicates againthat the selection criteria of the time-based digital resume absolutelymismatched the selection criteria of the time-based digital job order,and that each of the inputs placed the utmost strength in their opposingselection criteria (i.e.: this would occur when both selection criteriadeflected their “flat Y” (time-based aspiration preference) to theutmost deflection into the opposite direction (one towards zero and theother towards 100) away from the center point of 50). When thequantitative selection criteria (“flat Y” value) ranging from zero to1,000 of one time-based digital resume is geometrically graphed againstthe quantitative selection criteria (“flat Y” value) of one time-baseddigital job order, a theoretical ‘perfect match’ occurs along thegeometric line extending from the XY points of 0,0 thru 1000,1000; andan ‘Absolute mismatch’ occurs along the geometric line extending fromthe XY points of 0,1000 thru 1000,0. While anywhere along the ‘perfectmatch’ line represents an identical selection criteria input by both thetime-based digital resume and the time-based digital job order, thenumerical PM 1000 value increases from zero to 1,000 based on theemphasis suggested by the input static selection criteria. Likewiseanywhere along the ‘Absolute mismatch’ line represents opposingselection criteria input by the time-based digital resume and thetime-based digital job order, with numerical PM 1000 value assigneddecreasing from −1 to −1,000 based on the opposing emphasis suggested bythe input static selection criteria.

Included within the virtual box process is a functional “accuracyvalue”, externalized for control by the users of both the time-baseddigital resume, and by the time-based digital job order. This “accuracyvalue” algorithmically tightens, or loosens the mathematical geometrywhich assigns matching and mismatching PM 1000 values. Setting a veryhigh “accuracy value” insures that only very precisely matched “flat Y”values fall into the “matching” category. Setting a very low “accuracyvalue” insures that even distantly matched “flat Y” values fall into the“matching” category.

Included within the virtual box process is a functional “baselinevalue”, externalized for control by the users of both the time-baseddigital resume, and by the time-based digital job order. This “baselinevalue” algorithmically sets a practical minimum numeric for the“accuracy value”, to effect a built-in judiciousness to the ‘highest’“accuracy value”. Using a “baseline value” of 98% will effect a 2%leeway where any user requesting an “accuracy value” of 100% will stillbe found to ‘match’, and using a “baseline value” of 100% mandates thatany user requesting an “accuracy value” of 100% will ‘mismatch’ withevery selection criteria that is not the exact same zero to 100preference value.

The time-based digital resume aspirations matching process includes aflatten process for reducing time-based selection criteria from thetime-based digital resume and the time-based digital job order, intoquantitative “flat Y” values, which represent non-time-based selectioncriteria similar to other discrete pieces of static user data commonlyfound in other skills matching software available today.

The time-based digital resume aspirations matching process includes avirtual box process for matching discrete pieces of static skillsmatching selection criteria from the time-based digital resume, againstdiscrete pieces of static skills matching selection criteria from thetime-based digital job order.

The time-based digital resume aspirations matching process includes aranking process for prioritizing the match between any given time-baseddigital resume, and any given time-based digital job order.

The time-based digital resume aspirations matching process includes amatchbox process for manipulation and retention of skills matchingselection criteria, once they are reduced into static data format thruthe flatten process, matched thru the virtual box process, andprioritized thru the ranking process. User interfaces 192, 194, 196, and198 are utilized in implementing some embodiments of the presentinvention.

The time-based digital resume aspirations matching process enables usercontrol over the “accuracy” of the geometric mathematics used to for amatch between the time-based digital resume and the time-based digitaljob order.

The time-based digital resume aspirations matching process enables usercontrol over the “urgency” which the owner of the time-based digitalresume, or the owner of the time-based digital job order feels ineffecting a skills match.

The time-based digital resume aspirations matching process enables usercontrol over the “emphasis” to place on “aspirations” over backgroundskills matching selection criteria, during the analytical match betweenthe time-based digital resume and the time-based digital job order.

The time-based digital resume aspirations matching process exposesinterim data analytic facts as information to the user, by associating,correlating and ranking individual matching/mismatching/lacking/equaleddata facts, and then depicting these results thru full-color graphicalfeedback reports.

The matchbox method provides the physical and virtual data schema intowhich the time-based digital resumes and time-based digital job ordersare placed, prepared, flattened, backfilled and ranked. Each matchboxconsists of two sets of four database tables: the half headers, the halfrecs, the rank recs, and the graph recs. One set of the four tablesholds the flattened, matched and ranked time-based digital resumes, andthe other set holds the flattened, matched, and ranked time-baseddigital job orders.

The ranking process depicted as 200 (FIG. 26) and Tables 9 and 10mathematically analyzes the numerical “PM 1000 Values” of the time-baseddigital job order and time-based digital resumes in the matchbox, tomake informative recommendations of best fit relationships betweendigital resumes and digital job orders. The ranking method externalizesa set of control parameters called “rankable flags”, to enable theruntime adjustment of those algorithms which analyze and match the“PM1000 Values” of the time-based digital resumes against the “PM 1000Values” of the time-based digital job orders. There are 13 flagsallowing the inclusion or inclusion of: importance, proficiency,preference, urgency, accuracy, spam, aspirations, pay, distance, travel,availability, healthcare and fulltime, to either effect or not-effectthe ranking method analytics.

TABLE 9 private void assign_RankRecs_rankings( string clientName, doubleprogress ) { // ================================================== ///Purpose: Rank each Cube-Req grouping in the RankRecs table /// Function:Group the RankRecs into Cube-Req groupings. Then by including each of/// the criteria which are set as “Rankable” average the pm1000's andassign /// the Rank /// Status: Knowingly exposed in that this routinecaches EVERY single flatHS,PR,BE /// row into an in-memory Rank Tablebefore flushing it out! yikes! /// Future:Clip Rank Table at somelegitimate level(say 5,000 rows), and flush /// it out into theMatchBox. // ================================================== doublecubeProgress = 0; double reqProgress = 0; double flushProgress =progress; if (matchBox1.CubeRankRecs.Count +matchBox1.ReqRankRecs.Count > 0) { cubeProgress = (matchBox1.CubeRankRecs.Count* progress/(matchBox1.CubeRankRecs.Count+matchBox1.ReqRankRecs.Count)) * .8;reqProgress = ( matchBox1.ReqRankRecs.Count * progress/(matchBox1.CubeRankRecs.Count+matchBox1.ReqRankRecs.Count)) * .8;flushProgress = progress-cubeProgress-reqProgress; open_matchBox(clientName ); // pseudo code // for each Cube/Req RankRec(ord) group,filter down to the ‘isRankable’ records // calculate the average pm1000value within the Match Quadrant // // employers Spam? // employersUrgency? // employers Accuracy? // ==============================//=Rank the pm1000 values within each rider, of each reportQuad, of eachdriver // ============================== //============================== //=For The SkillCubes //============================== if ( matchBox1.CubeRankRecs.Count > 0) {DataView criteriaView = new DataView(matchBox1.CubeRankRecs, “isRankable= true”, “driverHalfHeaderKey,  riderHalfHeaderKey”,DataViewRowState.CurrentRows); if ( criteriaView.Count > 0)set_rankings( (DataTable)matchBox1.CubeRankRecs, criteriaView );addProgress( cubeProgress); // update the progressBar } //============================== //=For The SkillReqs //============================== if ( matchBox1.ReqRankRecs.Count > 0) {DataView criteriaView = new DataView(matchBox1.ReqRankRecs, “isRankable= true”, “driverHalfHeaderKey,  riderHalfHeaderKey”,DataViewRowState.CurrentRows); if ( criteriaView.Count > 0)set_rankings( (DataTable)matchBox1.ReqRankRecs, criteria View );addProgress( reqProgress); // update the progressBar } }flush_matchBox1( clientName, flushProgress ); } // end do_Matching( )

TABLE 10 private void set_rankings( DataTable table 1, DataView dv) {//====================================================================// Purpose: Impliment a mock SQL Query/Group/Update statement. //Function: Group all RankRecs by into riders, and update them with a rank// value equal to their average pm1000. // Status://====================================================================int lastDriver = Convert.ToInt32 ( dv[0][“driverHalfHeaderKey”] ); intlastRider = Convert.ToInt32 ( dv[0][“riderHalfHeaderKey”] ); int rank =−1; int itemCount = 0; int itemTotal = 0; foreach( DataRowViewcriteriaRow in dv ) { //when this rider/driver group changes, recurseand update ALL table1 //(not just rankable records in dv) //records withthis r/d pair with their calculated rank. if ( (Convert.ToInt32(criteriaRow[“riderHalfHeaderKey”]) != lastRider ) ∥(Convert.ToInt32(criteriaRow[“driverHalfHeaderKey”]) != lastDriver ) ) {// mark all riders associated with the last driver with their rank if (rankingMethod == RANKINGMETHOD_QUALITY ) rank = itemTotal/itemCount; //manual AVG(reason) function else rank = itemTotal; // manual SUM(reason)function DataView riderView = new DataView(table1, “driverHalfHeaderKey= ”+ lastDriver.ToString( ) +“ AND riderHalfHeaderKey = ”+lastRider.ToString( ), “”, DataViewRowState.CurrentRows ); foreach(DataRowView rankRow in riderView ) rankRow[“rank”] = rank; itemCount =0; itemTotal = 0; } itemCount++; itemTotal +=Convert.ToInt32(criteriaRow[“reason”]); lastDriver =Convert.ToInt32(criteriaRow[“driverHalfHeaderKey”]); lastRider =Convert.ToInt32(criteriaRow[“riderHalfHeaderKey”]); }//================= //=All thru - assign the final group it's Rank//================= if (itemCount>0) { // mark all riders associatedwith the last driver with their rank if ( rankingMethod ==RANKINGMETHOD_QUALITY ) rank = itemTotal/itemCount; // manualAVG(reason) function else rank = itemTotal; // manual SUM(reason)function DataView riderView = new DataView(table1, “driverHalfHeaderKey= ”+ lastDriver.ToString( ) +“ AND riderHalfHeaderKey = ”+lastRider.ToString( ), “”, DataViewRowState.CurrentRows ); foreach(DataRowView rankRow in riderView ) rankRow[“rank”] = rank; } }// end ( )

TIME-BASED DIGITAL RESUME SKILLS INFRASTRUCTURE METHOD AND SYSTEM: AsFIG. 27 shows, the present invention provides a system 206 havingdigital resume private exchange for establishing a stand-alone platformfor containing and matching time-based digital job orders and time-baseddigital resumes, as well as a front-end platform for interacting withthe back-end public exchange thru the backfill and publish methods.

The present invention provides an on-site exchange that establishes botha stand-alone platform for containing and matching time-based digitaljob orders and time-based digital resumes, and a front-end platform forinteracting with the back-end public exchange thru the backfill andpublish methods.

The present invention further provides a digital resume public exchangethat establishes a stand-alone platform for containing time-baseddigital resumes and matching them with time-based digital job ordersmade available from either a private exchange or an on-site exchangethru the publish or backfill methods.

FIG. 27 further shows that the present invention provides digital resumeprivate exchanges and on-site exchanges which may operate as stand-aloneentities capable of retaining and matching internal time-based digitaljob orders with internal time-based digital resumes. The method andsystem permit the user to access and reach externally into the publicexchanges for time-based digital resumes using a backfill and publishprocess. The digital resume public exchange operates as stand-alonesupport entity that includes the following functions:

1. Fulfilling digital job orders that are backfilled from either theprivate exchanges or the on-site exchanges;

2. Matching digital job orders that are published from either theprivate exchanges or the on-site exchanges;

3. Analytically matching digital resumes with digital job orders thatoriginate in either a private exchange or an on-site exchange; and

4. Create a functionally interconnected national infrastructure.

FIGS. 28 and 29, respectively, illustrate one embodiment of a time-baseddigital resume creation system having user interface 208 and time-baseddigital job requirement creation system having user interface 210according to the teachings of the present invention. The time-baseddigital resume creation system and the time-based digital jobrequirement creation system are functions for building and maintainingtime-based digital resumes and time-based digital job orders. Each ofthese functions implement elements of the time-base method of thepresent invention, the time-based digital resume flatten method, thetime-based digital resume graphical feedback report process, and thedigital resume infrastructure method.

The present invention further provides a teamed digital resume functionand a teamed digital job order function, using object orientatedsoftware manifestations of the time-based digital resume and thetime-based digital job requirement. The teamed digital resumeinstantiates the time-based digital resume into a ‘team’ of time-baseddigital resumes, in order to represent the consolidated time-baseddigital resumes of a full ‘team’. The teamed digital job orderinstantiates the time-based digital job requirement into a ‘team’ oftime-based digital job orders, in order to represent the consolidatedtime-based digital job orders for a full ‘team’.

Still further the present invention provides a firm- or company-baseddigital resume function and digital job order function to provide anobject orientated software manifestations of the teamed digital resumefunction and teamed digital job order function. The firm-based digitalresume instantiates the team-based digital resume into a firm or companyfull of teamed digital resumes, in order to represent the consolidatedtime-based digital resumes of a full firm. The firm-based digital joborder function instantiates the teamed digital job order into a firmfull of teamed digital job orders, in order to represent theconsolidated time-based digital job orders for a full firm.

FIG. 30 shows a representation of the backfill process 212 of thepresent invention, which provides the algorithmic extension 214 for theprivate and on-site exchanges 220 to ‘reach’ out into the publicexchange 216 and extract matching time-based digital resumes into aPublic Scope 218, based on analytic inputs (minimum ranking values) anda single time-based digital job order. In addition, the presentinvention provides a publish process which is an algorithmic extension212 of the private and on-site exchanges 220. These features extend thefunctionality of associated time-based digital job orders out beyondtheir own framework 220, and into the public exchange 216 for thepurpose of exposing greater visibility of the time-based digital joborder to time-based digital resumes.

FIGS. 31 and 32, respectively present the infrastructure components 221and the architecture 222 for time-based digital resume and time-baseddigital job order that the present invention provides. Thus, through thepresent invention, there are provided the following capabilities:

1. A national infrastructure within the field of human resources, forthe exchange of standardized digital resumes;

2. A national infrastructure within the field of human resources, forthe exchange of standardized digital job orders;

3. A process and associated system for interlinking skills matchingdatabases belonging to disparate companies;

4. A process and associated system for locating the best-fit digitalresume, from amongst many disparate corporate skills matching databases,herein referred to as backfilling;

5. A process and associated system for exposing digital job orders to apublic database of digital resumes, herein referred to as publishing;

6. A time-based digital resume creation, modification, and managementsystem;

7. A time-based digital job requirement creation, modification, andmanagement system;

8. A method and system for creating and managing fill-color graphicalfeedback reports of workers;

9. An application server program for managing the human resourcesprocess and providing the above functions and features;

10. System of ISV tools for use in the human resources function;

11. A method and system for providing teamed digital resumes;

12. A method and system for providing firm-based digital resumes;

13. A method and system for matching time-based digital resumes withtime-based digital job orders;

14. A method and system for generating full-color graphical feedbackreports;

15. A method and system for improving the privacy of the automation in adigital human resources process;

16. A method and system of standard or template digital resumes;

17. A method and system of standard or template digital job orders;

18. XML standards for use with digital resumes and digital job orders;

19. A backfill method and system for use with time-based digital resumesand time-based digital job orders; and

20. A publishing method and system for processing time-based digitalresumes and time-based digital job orders.

PROCESS FOR RECORDING TIME-BASED DIGITAL RESUME SELECTION CRITERIA ANDTIME-BASED DIGITAL JOB ORDER SELECTION CRITERIA: The process of userinput and data manipulation available in the known field of humanresources skills matching, involve discrete pieces of static skillsmatching selection criteria selected from predefined lists presented tothe user for selection through software user interface motifs, includingbut not limited to; the drop-down box, selection box, radio buttons, andcheck boxes. Quantifiable user input is also enabled thru software userinterface motifs including but not limited to the slide bar/slider, andopen data entry fields.

The current process of user input and data manipulation available in theknown field of human resources skills matching are ‘static,’ and do notchange on their own once they are input; they are not dynamic and“time-based.” The digital resumes time-based process provides newgraphical software user interface techniques and mathematic processeswhich enable user selection criteria to be dynamic, and change over aspecified period of calendar time as directed by the user. Thetime-based process described herein, when applied to the field of humanresources skills matching, allows candidates (building digital resumes)and employers (building digital job orders) to specify gradients ofdynamic skills matching selection criteria, using a user specifiedperiod of calendar dates. As time progresses, the skills matchingselection criteria effectively change in a dynamic fashion withoutfurther user input. The time-based process described herein isincorporated within the digital resume formation process and system forcreation of dynamic time-based digital resumes, and into the digital joborder formation process and system for creation of dynamic time-baseddigital job orders, and into the digital resumes matching engine formatching time-based digital resumes to time-based digital job orders.

1. Forms a part of the digital resume formation process and system,which produces time-based digital resumes.

2. Forms a part of the digital job order formation process and system,which produces time-based digital job orders.

3. Forms a part of the digital resumes aspirations matching processwhich matches time-based digital resumes to time-based digital joborders.

4. Presents a unique graphical user interface which enables users oftime-based digital resumes and time-based digital job orders, to specifydynamic time-based selection criteria.

5. Provides a graphical user interface process for specifying skillsmatching selection criteria, into the field of human resources.

6. Provides a set of geometric mathematical processes into the field ofhuman resources skills matching, for reducing and reconstitutingtime-based selection criteria input by users, and output into skillsmatching analytics software.

7. Accepts graphical user interface input through a computer mouse andkeyboard from a user (creation of a time-based digital resume, orcreation of a time-based digital job order), including a calendar startdate, a calendar end date, and a definable series of X axis and Y axispoints, representative of the change in user selection criteria over aperiod of time.

8. Enables otherwise static skills matching selection criteria to behavedynamically over a described period of time without further user input.

One example of time-based matching using the present invention is thefollowing. Consider a consulting firm's internal skills matching processfor allocating resources to contracts effects their green revenuedollars. Consultants sitting ‘on the bench’ with low utilization ratesturn an otherwise profitable revenue business into an expense problem.The following scenario brings together a qualified consultant with aconsulting firm's signed contract.

Table 11 relates to the time-based process of the present invention. Thedigital resumes time-based process 228 includes both a graphicalcomputer user interface for entering time-based selection criteria, anda set of geometric mathematical processes for reducing andreconstituting the time-based user selection criteria to/from an interimcomputer data storage device.

TABLE 11 private int flatten_Cube_TimeBase ( Cube.TimeBaseDataTable tbT,string skUID, string tbType ) {return ( flatten_Cube_TimeBase ( tbT,skUID, tbType, “”, “”, “” ) ); } private int flatten_Cube_TimeBase (Cube.TimeBaseDataTable tbT, string skUID, string tbType, string id1,string id2, string id3 ) {///=======================================================================================/// Purpose: Translate a set of TimeBase Points over a given time span,/// into a singular Y value representative of the Yvalue on the ///given runDate of this Matching Engine execution. /// Function: ///Status: /// Future:///=======================================================================================Point[ ] myPoints = new Point[10]; Cube.TimeBaseRow tbRow =tbT.FindByskUIDtbTypeid1id2id3 ( skUID, tbType, id1, id2, id3 ); if (tbRow == null) { dbError dbe = new dbError( ); dbe.text1Label.Text = “inflatten_Cube_timebase( ) − tbRow is null ”; dbe.text2Label.Text =“skUID: ”+skUID; dbe.text3Label.Text = “Plus: id1(“+id1+”),id2(“+id2+”), id3(“+id3+”), tbType(“+tbType+”)”; dbe.ShowDialog ( );dbe.Dispose( ); return ( ); } // ==================================== //if runDate is before/after the TB span, then return the Y0/Y9 value andwe're thru // ==================================== if ( runDate <=tbRow.startDate ) return tbRow.Y0; else if ( runDate >= tbRow.endDate )return tbRow.Y9; // ==================================== // so we'rewithin the TBspan(not befor X0, or after X9. find the appropriatesegment, // and calculate the Yvalue //==================================== myPoints[0].X = tbRow.X0;myPoints[1].X = tbRow.X1; myPoints[2].X = tbRow.X2; myPoints[3].X =tbRow.X3; myPoints[4].X = tbRow.X4; myPoints[5].X = tbRow.X5;myPoints[6].X = tbRow.X6; myPoints[7].X = tbRow.X7; myPoints[8].X =tbRow.X8; myPoints[9].X = tbRow.X9; myPoints[0].Y = tbRow.Y0;myPoints[1].Y = tbRow.Y1; myPoints[2].Y = tbRow.Y2; myPoints[3].Y =tbRow.Y3; myPoints[4].Y = tbRow.Y4; myPoints[5].Y = tbRow.Y5;myPoints[6].Y = tbRow.Y6; myPoints[7].Y = tbRow.Y7; myPoints[8].Y =thRow.Y8; myPoints[9].Y = tbRow.Y9; return ( flatten( myPoints,tbRow.numPoints, tbRow.startDate, tbRow.endDate ) ); } private intflatten_Req_TimeBase( Req.ReqTimeBaseDataTable tbT, string companyName,string skrUID, string tbType ) {return ( flatten_Req_TimeBase( tbT,companyName, skrUID, tbType, “”, “”, “” )); } private intflatten_Req_TimeBase( Req.ReqTimeBaseDataTable tbT, string companyName,string skrUID, string tbType, string id1, string id2, string id3 ) }///================================================================================/// Purpose: Translate a set of TimeBase Points over a given time span,/// into a singular Y value representative of the Yvalue on the ///given runDate of this Matching Engine execution. /// Function: ///Status: /// Future:///================================================================================Point[ ] myPoints = new Point[10]; Req.ReqTimeBaseRow tbRow =tbT.FindBycompanyNameskrUIDtbTypeid1id2id3( companyName, skrUID, tbType,id1, id2, id3 ); if ( tbRow == null) { dbError dbe = new dbError( );dbe.text1Label.Text = “in flatten_req_timebase( ) − tbRow is null”;dbe.text2Label.Text = “Company Name: ”+companyName; dbe.text3Label.Text= “skrUID: ”+skrUID; dbe.text4Label.Text = “Plus: “+id1+”, “+id2+”,“+id3+”, ”+tbType; dbe.ShowDialog( ); dbe.Dispose( ); return ( ); }//=============================== //if runDate is before/after the TBspan, then return the Y0/Y9 value and we're thru//=============================== if ( runDate <= tbRow.startDate )return tbRow.Y0; else if( runDate >= tbRow.endDate ) return tbRow.Y9;//=============================== // so we're within the TBspan(notbefor X0, or after X9. // find the appropriate segment, and calculatethe Yvalue //=============================== myPoints[0].X = tbRow.X0;myPoints[1].X = tbRow.X1; myPoints[2].X = tbRow.X2; myPoints[3].X =tbRow.X3; myPoints[4].X = tbRow.X4; myPoints[5].X = tbRow.X5;myPoints[6].X = tbRow.X6; myPoints[7].X = tbRow.X7; myPoints[8].X =tbRow.X8; myPoints[9].X = tbRow.X9; myPoints[0].Y = tbRow.Y0;myPoints[1].Y = tbRow.Y1; myPoints[2].Y = tbRow.Y2; myPoints[3].Y =tbRow.Y3; myPoints[4].Y = tbRow.Y4; myPoints[5].Y = tbRow.Y5;myPoints[6].Y = tbRow.Y6; myPoints[7].Y = tbRow.Y7; myPoints[8].Y =tbRow.Y8; myPoints[9].Y = tbRow.Y9; return ( flatten( myPoints,tbRow.numPoints, tbRow.startDate, tbRow.endDate ) ); } private intflatten( Point[ ] myPoints, int numPoints, DateTime startDate, DateTimeendDate ) {///=======================================================================================/// Purpose: Translate a set of TimeBase Points over a given time span,/// into a singular Y value representative of the Yvalue on the ///given runDate of this Matching Engine execution. /// Function: ///Status: /// Future:///=======================================================================================float flatY; float flatX; float segmentrunPercent; float segmentrise;float runX; float riseY; long tbTicks; long runDateTicks; // determine #of ticks between tbRow.end and tbRow.start // determine wherebefore/middle/end of start-end spread, that the runDate falls // grabthose two tbPoints(left & right), build a rise/run box, reconcile riseto get flatY value tbTicks = endDate.Date.Ticks − startDate.Date.Ticks;runDateTicks = runDate.Date.Ticks − startDate.Date.Ticks; flatX =(runDateTicks* TB_LENGTH/*100 or 1000*/) / tbTicks;//========================================================= // identifythe TB segment which bounds the given runDate // use the flatX togeometrically slice the virtual box of the TB segment//========================================================= int i; for(i = 1; i< numPoints; i++) if( myPoints[i].X >= flatX ) break; // loopto find the appropriate TB segment /// pseudo code //since we're here,there's a point[i] on our right, and a point on our left[i-1]//calculate the runx as the run distance between the leftX and rightX//calculate the riseY as the rise distance between the leftY and rightY//calculate the segmentrunPercent(how far into the runX is the flatX?)//then apply the segmentrunPercent(as a geometirc equivilant%(rise%=run%) )to the riseY giving segmentrise //Giving: the flatY asthe leftY plus the riseY :-) Whew ! runX = myPoints[i].X −myPoints[i-1].X; riseY = myPoints[i].Y − myPoints[i-1].Y;segmentrunPercent = (flatX − myPoints[i-1].X)/runX; //bugsegmentrunPercent = flatX/runX; segmentrise = riseY * segmentrunPercent;flatY = myPoints[i-1].Y + segmentrise; if ( flatY > 100) flatY = 100;else if (flatY < 0) flatY= 0; return (Convert.ToInt32( flatY )); }//end( )

The digital resumes time-based process user interface represents aunique and novel process for entering dynamic skills matching selectioncriteria, using a computer mouse, screen and keyboard. The graphicalcomputer user interface enables selection of an initial calendar startdate, an ending calendar end date, and a user defined series of gradientX axis and Y axis points on a graph. Using the computer mouse, the usermanipulates the gradient X axis and Y axis points on the graph, or thesegments between those graph points as a process of dynamically basingtheir skills matching selection criteria on ‘time’.

The flatten process 156 of the present invention reduces the dynamictime-based selection criteria of both the digital resume and the digitaljob order into discrete, static, quantitative selection criteria (“flatY” values). Geometric mathematics are applied to dynamic time-basedskills matching selection criteria, along with a specific calendar rundate, to flatten the dynamic criteria into a single quantifiable “flatY” value. If the specific calendar date precedes the timeline start dateof the time-based criteria, then the “flat Y” value associated with an Xaxis value defined by the start date results. If the specific calendardate exceeds the end date timeline of the time-based criteria, then the“flat Y” value associated with the X axis value defined by the end dateresults. For all calendar dates which fall within the timeline betweenthe time-based start date and the time-based end date, the followinggeometric mathematics are applied:

1) Use the specified calendar date to index into the time-basedtimeline, between the start date and end date;

2) Locate the specific time-based segment as defined by a selectioncriteria preference value less than (on the left of), and the nextcalendar selection preference value greater than (on the right of) thespecified calendar date;

3) Use the specified calendar date to index into the specific time-basedsegment to derive a percentage value of X axis or ‘run value’;

4) Determine the delta Y ‘rise value’ distance between the time-based Yaxis point values associated with the calendar date less than thespecified calendar date, and the time-based Y axis point valuesassociated with the calendar date greater than the specified calendardate;

5) Derive the resultant static “flat Y” value by applying the X axis‘run value’ percentage to that of the Y axis ‘rise value’.

FULL-COLOR GRAPHICAL FEEDBACK REPORTING BETWEEN TIME-BASED DIGITALRESUMES AND TIME-BASED DIGITAL JOB ORDERS: The full-color graphicalfeedback report described herein informs users of time-based digitalresumes, and users of time-based digital job orders of the interimanalytic factors causing a “match” during the skills matching andranking process.

The method and system represents a unique and novel technique ofinforming users of time-based digital resumes, and users of time-baseddigital job orders of the interim analytic factors causing a “mismatch”during the skills matching and ranking process. The present inventioninforms users of time-based digital resumes and users of time-baseddigital job orders of the interim analytic factors “lacking” during theskills matching and ranking process. The present invention informs usersof time-based digital resumes and users of time-based digital job ordersof the interim analytic factors “equaled” during the skills matching andranking process. Moreover, the present invention informs users oftime-based digital resumes, and users of time-based digital job ordersof the location within a national infrastructure of disconnectedrepositories, where their “best fit” skills match can be located.Mathematical algorithms within the field of human resources skillsmatching depict strengths & weaknesses of ‘matching’, ‘mismatching’,‘lacking’, and ‘equaled’ data points within a single graphical report.

All references, including publications, patent applications, andpatents, cited herein are hereby incorporated by reference to the sameextent as if each reference were individually and specifically indicatedto be incorporated by reference and were set forth in its entiretyherein.

The use of the terms “a” and “an” and “the” and similar referents in thecontext of describing embodiments of the invention (especially in thecontext of the following claims) are to be construed to cover both thesingular and the plural, unless otherwise indicated herein or clearlycontradicted by context. The terms “comprising,” “having,” “including,”and “containing” are to be construed as open-ended terms (i.e., meaning“including, but not limited to,”) unless otherwise noted. Recitation ofranges of values herein are merely intended to serve as a shorthandmethod of referring individually to each separate value falling withinthe range, unless otherwise indicated herein, and each separate value isincorporated into the specification as if it were individually recitedherein. All methods described herein can be performed in any suitableorder unless otherwise indicated herein or otherwise clearlycontradicted by context. The use of any and all examples, or exemplarylanguage (e.g., “such as”) provided herein, is intended merely to betterilluminate embodiments of the invention and does not pose a limitationon the scope of the invention unless otherwise claimed. No language inthe specification should be construed as indicating any non-claimedelement as essential to the practice of the invention.

Preferred embodiments of this invention are described herein, includingthe best mode known to the inventors for carrying out the invention.Variations of those preferred embodiments may become apparent to thoseof ordinary skill in the art upon reading the foregoing description. Theinventors expect skilled artisans to employ such variations asappropriate, and the inventors intend for the invention to be practicedotherwise than as specifically described herein. Accordingly, thisinvention includes all modifications and equivalents of the subjectmatter recited in the claims appended hereto as permitted by applicablelaw. Moreover, any combination of the above-described elements in allpossible variations thereof is encompassed by the invention unlessotherwise indicated herein or otherwise clearly contradicted by context.

1. A computer network system for facilitating the creation oftime-dependent electronic proposals and the matching thereof, the systemcomprising: a computer readable storage medium comprising a plurality oftime-dependent electronic proposals, each of said time-dependentelectronic proposals comprising: at least one automatically updatingtime-variant field comprising: a calendar start date field; a calendarend date field; and a plurality of coordinate data pairs which comprisea date value and a magnitude value, wherein the magnitude valueassociates with a user selection criterion, the data being suitable fordynamic time-dependent variance of values associated with said at leastone time-dependent electronic proposal; at least one exchange forreceiving, containing, and matching said plurality of time-dependentelectronic proposals, said at least one exchange for matching saidplurality of time-dependent electronic proposals based on said at leastone time-variant field; wherein said at least one time-dependentelectronic job order and/or at least one time-dependent electronicresume further comprises aspirations data, said aspirations dataproviding information regarding career aspirations; and an interfaceassociated with said at least one exchange, said interface for creating,updating, and viewing said plurality of time-dependent electronicproposals.
 2. The system of claim 1, wherein said plurality oftime-dependent electronic proposals comprises at least onetime-dependent electronic job order and/or at least one time-dependentelectronic resume.
 3. The system of claim 2, further comprising: meansfor enabling third-party proprietary software, which matches at leastone electronic resume to at least one electronic job order, to implementsaid at least one time-variant field.
 4. The system of claim 2, furthercomprising: means for enabling third-party proprietary software, whichforms matches between electronic resumes and electronic job orders, tocommunicate with said at least one time-dependent electronic resume andsaid at least one time-dependent electronic job order contained in saidat least one exchange.
 5. The system of claim 2, further comprising:means for enabling all third-party skills matching software vendors toaccess full-color graphical feedback reports generated by matching saidplurality of electronic proposals.
 6. The system of claim 1, furthercomprising means for interlinking a plurality of exchanges.
 7. Thesystem of claim 6, wherein said means for interlinking a plurality ofexchanges further comprises a full-time public network.
 8. The system ofclaim 6, wherein said at least one exchange further comprises an on-siteexchange, a private exchange, and/or a public exchange.
 9. The system ofclaim 8, wherein said plurality of time-dependent electronic proposalsmay be matched based on time-dependent electronic proposals included inany of said on-site exchange, said private exchange, or said publicexchange.
 10. The system of claim 1, wherein said plurality oftime-dependent electronic proposals further comprises one or morestandardized templates adapted to facilitate the creation of said atleast one time-variant field.
 11. The system of claim 1, wherein thecontents of said plurality of time-dependent electronic proposals isconfigured in accordance with redefined XML standards.
 12. The system ofclaim 1, further comprising: means for maintaining privacy and anonymitybetween any two parties using said plurality of time-dependentelectronic proposals.
 13. The system of claim 1, wherein said at leastone exchange further matches said plurality of time-dependent electronicproposals based on a single numerical value generated given a singletime.
 14. The system of claim 1, wherein said interface furthercomprises a Virtual Box, said Virtual Box graphically presenting matchvalues between two time-dependent electronic proposals.
 15. Atime-basing method for use with a computer processing system infacilitating preprogrammed time-dependent variation in an electronicproposal, comprising the steps of: receiving in a computer processingsystem time-variant input data including a calendar start date, acalendar end date, and a plurality of coordinate data pairs whichcomprise a date value and a magnitude value, wherein the magnitude valueassociates with a user selection criterion, the data being suitable fordynamic time-dependent variance of values associated with at least onetime-dependent electronic proposal; wherein said at least onetime-dependent electronic proposal further comprises at least oneelectronic resume, said at least one time-dependent electronic resumefurther comprising aspirations data, said aspirations data providinginformation regarding career aspirations; storing in said computerprocessing system said at least one time-dependent electronic proposal;said time-variant input data automatically updating said time-dependentelectronic proposal; comparing in said computer processing system saidat least one time-dependent electronic proposal to one or more otherproposals; and calculating in said computer processing system a matchvalue for each comparison of said at least one time-dependent electronicproposal to said one or more other proposals.
 16. The method of claim15, wherein said aspirations data further comprises time-variant inputdata.
 17. The method of claim 15, wherein said at least onetime-dependent electronic proposal comprises a time-dependent electronicjob order and said one or more other proposals comprise electronicresumes.
 18. The method of claim 15, further comprising the step of:decomposing in said computer processing system said time-variant inputdata into corresponding static data which inherently includes thetime-variant data but is not in time-variant format.
 19. The method ofclaim 18, further comprising the step of: utilizing in said computerprocessing system the decomposed data in comparing electronic proposalsto enable otherwise static skills matching selection criteria to behavedynamically over a described period of time without further user input.20. The method of claim 15, further comprising the step of generating insaid computer processing system full-color graphical feedback reportsdepicting said match value.